منابع مشابه
Compiling Higher-Order Functions for Tagged-Dataflow
The implementation of higher-order functions on tagged-dataflow machines has always been a problematic issue. This paper presents and formalizes an algorithm for transforming a significant class of higher-order programs into a form that can be executed on a dataflow machine. The meaning of the resulting code is described in terms of Intensional Logic, a mathematical formalism which allows expre...
متن کاملAutomatically Inferring Sound Dataflow Functions from Dataflow Fact Schemas
In previous work, we presented a language called Rhodium for writing program analyses and transformations that could be checked for soundness automatically. In this work, we present an algorithm for automatically inferring sound flow functions given only a set of dataflow fact schemas. By generating the flow functions mechanically, our approach reduces the burden on compiler writers. This paper...
متن کاملAlmost Continuous Transformations of Software and Higher-order Dataflow Programming
We consider two classes of stream-based computations which admit taking linear combinations of execution runs: probabilistic sampling and generalized animation. The dataflow architecture is a natural platform for programming with streams. The presence of linear combinations allows us to introduce the notion of almost continuous transformation of dataflow graphs. We introduce a new approach to h...
متن کاملXML schemas without order
XML schemas consist of context-free grammars that allow regular expressions on the right-hand side of productions. In the schema definition language ScmDL, XML schemas are enhanced to, among other things, mark nodes as ordered or as unordered. An unordered node is then derived by a production with a regular expression r if the string induced by its children belongs to the symmetric closure of r...
متن کاملDataflow Graphs as Matrices and Programming with Higher-order Matrix Elements
We consider dataflow architecture for two classes of computations which admit taking linear combinations of execution runs: probabilistic sampling and generalized animation. We improve the earlier technique of almost continuous program transformations by adopting a discipline of bipartite graphs linking nodes obtained via general transformations and nodes obtained via linear transformations whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90306-m